Propositional connectives, supposition, and consequence in Paul of Pergola.
نویسندگان
چکیده
منابع مشابه
Propositional Logic of Supposition and Assertion
1 and suggestions of my colleague John Corcoran. The present paper is much superior to earlier versions as a result of his input. 1 1. LANGUAGE AND SPEECH ACTS In this paper I develop a system of what I understand to be illocutionary logic. In order to motivate this system and make it intelligible to the reader, I briefly sketch a philosophical basis for the system. This sketchy foundation will...
متن کاملNon-deterministic Connectives in Propositional Godel Logic
We define the notion of a canonical Gödel system in the framework of single-conclusion hypersequent calculi. A corresponding general (nondeterministic) Gödel valuation semantics is developed, as well as a (non-deterministic) linear intuitionistic Kripke-frames semantics. We show that every canonical Gödel system induces a class of Gödel valuations (and of Kripke frames) for which it is strongly...
متن کاملCalibrating the Complexity of Ternary Propositional Connectives
For each ternary propositional connective, we determine the minimum number of binary connectives needed to construct a logically equivalent formula. In order to reduce this problem to a computably feasible one, we prove a number of lemmas showing that every element of a large set of formulas is logically equivalent to a formula in a much smaller associated set. Acknowledgements: Professor Jeffr...
متن کاملThe Spontaneous Use of Propositional Connectives
The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date. The accuracy of any instructions, formulae, and drug doses should be independently verified with primary sources. The publisher shall not be liable
متن کاملRepresenting Propositional Logic Connectives With Modular Polynomials
This paper explores the relationship between n-valued propositional logic connectives and modular polynomials. Namely the representing of logic connectives using modular polynomials. The case for n = 2 is explored and a method is developed for finding the coefficients of the unique polynomial that represents any given binary logic connective. Examples are then given for using the modular polyno...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 1966
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1093958485